Classifying the phase transition threshold for unordered regressive Ramsey numbers
نویسندگان
چکیده
Following ideas of Richer (2000) we introduce the notion of unordered regressive Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of Ackermannian growth rate. For a given number-theoretic function f we consider unordered f -regressive Ramsey numbers and classify exactly the threshold for f which gives rise to the Ackermannian growth rate of the induced unordered f -regressive Ramsey numbers. This threshold coincides with the corresponding threshold for the standard regressive Ramsey numbers. Our proof is based on an extension of an argument from a corresponding proof in a paper by Kojman,Lee,Omri and Weiermann 2007.
منابع مشابه
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressive colorings have usual Ramsey numbers, that is, admit homogeneous, rather than just min-homogeneous sets.
متن کاملThe Threshold for Ackermannian Ramsey Numbers
For a function g : N → N, the g-regressive Ramsey number of k is the least N so that N min −→ (k)g. This symbol means: for every c : [N ] → N that satisfies c(m, n) ≤ g(min{m, n}) there is a min-homogeneous H ⊆ N of size k, that is, the color c(m, n) of a pair {m, n} ⊆ H depends only on min{m, n}. It is known ([4, 5]) that Id-regressive Ramsey numbers grow in k as fast as Ack(k), Ackermann’s fu...
متن کاملSharp thresholds for hypergraph regressive Ramsey numbers
The f -regressive Ramsey number R f (d, n) is the minimum N such that every colouring of the d-tuples of an N -element set mapping each x1, . . . , xd to a colour ≤ f(x1) contains a min-homogeneous set of size n, where a set is called min-homogeneous if every two d-tuples from this set that have the same smallest element get the same colour. If f is the identity, then we are dealing with the st...
متن کاملRegressive functions on pairs
We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n,m), the least l such that any regressive function f : [m, l] → N admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the r...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کامل